package leetcode.biweekly.week102;

//Solution1Test
public class Solution1 {
	public int[] findColumnWidth(int[][] grid) {
		int m = grid.length, n = grid[0].length;
		int[] ans = new int[n];
		for (int i = 0; i < m; i++) {
			for (int j = 0; j < n; j++) {
				int cur = grid[i][j];
				ans[j] = Math.max(ans[j], String.valueOf(cur).length());
			}
		}
		return ans;
	}

}
